Roadscape-based Route Recommender System Using Coarse-to-fine Route Search
نویسندگان
چکیده
منابع مشابه
Electric Vehicle Route Recommender System
This paper presents a recommender system responsible for processing information that will help the driver in the daily use of his Electric Vehicle (EV), minimizing the problem of range anxiety through a personalized range prediction and by presenting in real time relevant information about the charging stations that can be reached within the range autonomy. Given the success of recommendation s...
متن کامل'Fine-to-Coarse' Route Planning and Navigation in Regionalized Environments
Environments that are divided into regions lead to hierarchical encoding of space. Such memory structures are known to systematically distort estimates of distance and direction and affect spatial priming and memory recall. Here we present two navigation experiments in virtual environments that reveal an influence of environmental regions on human route planning and navigation behaviour. Follow...
متن کاملCoarse-to-Fine Search Techniques
The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal paths, and refines those paths until a base level is found. Our most successful approach introduces a cached heuristic that reduces th...
متن کاملFlexible route lookup using range search
The rising number of entries in an Internet routing table is placing higher demands route lookup engines. This paper presents a hardware implementation of a route lookup engine based on a combination of range search and linear search. The route lookup engine is constructed using a pipeline of identical search units. The lookup engine can be configured with more than one routing table allowing f...
متن کاملUsing Knowledge to Isolate Search in Route Finding
Traveling is a part of every person's day-to-day life. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation when ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2019
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.27.392